منابع مشابه
Abductive Consequence Relations
In this paper we present a systematic study of abductive consequence relations. We show that a monotone abductive consequence relation satisses the properties of a cumulative monotonic system as deened by Kraus, Lehmann and Magidor when the disjunction of all abductive explanations is the explanation used to justify the observations. We also show that, in general, for this class of abductive co...
متن کاملConsequence Mining - Constants Versus Consequence Relations
The standard semantic definition of consequence with respect to a selected set X of symbols, in terms of truth preservation under replacement (Bolzano) or reinterpretation (Tarski) of symbols outside X, yields a function mapping X to a consequence relation ⇒X . We investigate a function going in the other direction, thus extracting the constants of a given consequence relation, and we show that...
متن کاملModal Consequence Relations
Logic is generally defined as the science of reasoning. Mathematical logic is mainly concerned with forms of reasoning that lead from true premises to true conclusions. Thus we say that the argument from σ0;σ1; · · · ;σn−1 to δ is logically correct if whenever σi is true for all i < n, then so is δ. In place of ‘argument’ one also speaks of a ‘rule’ or an ‘inference’ and says that the rule is v...
متن کاملJudgment and consequence relations
In this paper I argue that a variety of consequence relations can be subsumed under a common core. The reduction proceeds by taking the unconditional consequence, or judgment, as basic and deriving the conditional consequence via a uniform abstraction scheme. A specific outcome is that it is better not to base such a scheme on the semantic notion of a matrix and valuation but rather on theories...
متن کاملReducing Modal Consequence Relations
In this paper we will investigate the possibility of reducing derivability in a modal consequence relation to consistency in unimodal and polymodal K by means of so–called reduction functions. We will present new and easy methods to prove standard results on decidability, complexity, finite model property, interpolation and Halldén–completeness using only the reduction functions. Some new resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1997
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(96)00032-x